Big O notation - PDFSEARCH.IO - Document Search Engine

Big O notation
Results: 335

#	Item
151	Single- and Multi-Objective Genetic Programming: New Bounds for Weighted ORDER and MAJORITY Anh Nguyen Tommaso Urli Add to Reading List Source URL: www.tunnuz.net Language: English - Date: 2014-09-12 00:58:22 Mathematical optimization Applied mathematics Computational complexity theory Big O notation Pseudo-Boolean function Poisson distribution Expected value Linear programming relaxation Pareto distribution Mathematical analysis Mathematics Operations research
152	Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1 Add to Reading List Source URL: www.tunnuz.net Language: English - Date: 2014-09-12 00:58:22 Applied mathematics Mathematics Operations research Asymptotic analysis Mathematical optimization Big O notation Theoretical computer science Computational complexity theory Analysis of algorithms
153	lil’ UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits Kevin Jamieson† , Matthew Malloy† , Robert Nowak† , and S´ebastien Bubeck‡ † Department of Electrical and Computer Engineering, University Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2014-01-02 05:54:09 Analysis of algorithms Theoretical computer science Exponential distribution Exponentials Big O notation Ordinal number Mathematical analysis Mathematics Asymptotic analysis
154	Senior Development Committee USAS convention 2011 Present: Tony Young, Mary Liston, Shawn Smith, Paul Silver, Dennis Dale, Rick Shipherd, Tim Bauer, Dave Berkoff- VP, Dave Ferris - Chair and Tyler Storie Staff: Jack Roac Add to Reading List Source URL: usaswimming.org Language: English - Date: 2014-07-25 19:25:02 Mathematical notation Athletics Athletics at the 2008 Summer Olympics Athletics at the 1912 Summer Olympics Analysis of algorithms Asymptotic analysis Big O notation
155	arXiv:1306.3917v1 [stat.ML] 17 Jun[removed]On Finding the Largest Mean Among Many Kevin Jamieson† , Matthew Malloy†∗, Robert Nowak† , and S´ebastien Bubeck‡ † Department of Electrical and Computer Engineering, Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2013-10-02 22:52:43 Analysis of algorithms Normal distribution Big O notation SL Computational complexity theory Mathematics Mathematical analysis Applied mathematics
156	Random Sampling with a Reservoir JEFFREY SCOTT VITTER Brown University We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown Add to Reading List Source URL: www.mathcs.emory.edu Language: English - Date: 2005-10-15 23:23:14 Analysis of algorithms Randomized algorithm Big O notation Time complexity Expectation–maximization algorithm Pseudo-random number sampling Theoretical computer science Mathematics Applied mathematics
157	Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition Tianshi Gao Dept. of Electrical Engineering Stanford University Add to Reading List Source URL: ai.stanford.edu Language: English - Date: 2011-11-20 00:44:23 Support vector machine FO Multiclass classification Computational complexity theory Big O notation Perceptron Statistics Statistical classification Mathematics
158	Estimating Entropy and Entropy Norm on Data Streams Amit Chakrabarti∗ Khanh Do Ba† S. Muthukrishnan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-11-10 15:56:52 Applied mathematics Entropy Streaming algorithm Time complexity Binary logarithm Big O notation Polylogarithmic Randomized algorithm Estimation theory Theoretical computer science Mathematics Analysis of algorithms
159	Learning with a Limited Memory Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-11 04:26:15 Theoretical computer science Computer science Inductive inference Recursion Computable function Derivative Recursively enumerable set Big O notation Function Mathematics Theory of computation Computability theory
160	LOGARITHMIC LOWER BOUNDS IN THE CELL-PROBE MODEL∗ ˇ MIHAI PATRAS ¸ CU† AND ERIK D. DEMAINE† Abstract. We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enab Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2008-09-07 01:08:29 Big O notation Mathematical notation LG Corp Computational complexity theory Ordinal number Analysis of algorithms Mathematics Asymptotic analysis

UPDATE